Controlling State Explosion in Reachability Analysis
نویسندگان
چکیده
ii ACKNOWLEDGMENTS I am deeply indebted to Michal Young, my advisor. He gave me guidance when I needed it, and supplied me a salary, travel expenses, and equipment for my research. He has always been there for me, as an advisor and a friend. I am also grateful to my committee, Richard A. DeMillo and Eugene Spaaord, as well as Greg Frederickson, for reading the dissertation and ooering valuable technical advice. My companion and partner in all things is my wife Chien Ju Huang. She kept me happy and sane during my years as a student, while my lovely daughter Jessie, who likes to be a partner in all things, managed to drive me crazy and cheer me up from time to time. I am also thankful to my parents, Hung Sheng Yeh and Ling Wu. They have always been there, loving me and supporting me in every way. Without them I would not be what I am.
منابع مشابه
Reachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملProtocol Verification by Leaping Reachability Analysis
he communicating finite state machine (CFSM) model is one of the most widely used models for specifying and verifying communications protocols. In this model, a protocol is specified as a network of two or more processes exchanging messages over error-free simplex channels, where each process is a finite state machine (FSM) and each simplex channel is a FIFO queue. Protocol verification is ofte...
متن کاملDeadlock Detection in CFSM Models via Simultaneously Executable Sets
Reachability analysis is an extensively used technique in many areas such as protocol verification and concurrent program verification. The main limitation of this technique is its exponential complexity, i.e., the state explosion problem. The major contributor to the state explosion problem has been known as concurrency. Rather than examining all possible interleavings of concurrent behavior d...
متن کاملOn-the-fly Parameterized Boolean Program Exploration
Reachability analysis for replicated Boolean programs run by an unbounded number of threads is decidable in principle via a reduction of the Boolean program families to well-structured transition systems (WSTS). The obtained transition systems would, however, in general be intractably large, due to local state explosion. Basler et al. give an on-the-fly algorithm that solves this problem for Bo...
متن کاملprod 3.2: An Advanced Tool for Efficient Reachability Analysis
prod is a reachability analyzer for Predicate/Transition Nets. The tool incorporates several advanced reduced reachability graph generation methods. The tool also includes a CTL model checker and supports on-they veriication of LTL formulas. prod is being used in industrial projects at the Digital Systems Laboratory. 1 Intro Reachability analysis is a powerful formal way to analyze concurrent a...
متن کاملAlleviating State-space Explosion in Component-based Systems with Distributed, Parallel Reachability Analysis Algorithm
In this work, we alleviate the well-known State-Space Explosion (SSE) problem in Component Based Systems (CBS). We consider CBS that can be specified as a system of n Communicating Finite State Machines (CFSMs) interacting by rendezvous/handshake method. In order to avoid the SSE incurred by the traditional product machine composition of the given input CFSMs based on interleaving semantics, we...
متن کامل